Path
Part 2/3 • 5.9 KB total
──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────
Request
See also: Interface#Path seeking
If a node has no path to a destination, it can send out a path request on the network. Path seeking interfaces allow these requests to propagate recursively through the network. Any node that receives the request and has a path to the destination responds by rebroadcasting the cached announce, which eventually reaches the requester node. This also serves to update path tables along the way.
Path requests are rate limited.cite-ref-2[2]
Note: Applications should only request paths for destinations they need to communicate with. Applications that send large amounts of unnecessary path requests will get rate limited by transport nodes, negatively affecting the system they are running on.
See also
References
cite-note-11. ↑ Aleph Git ↗
cite-note-22. ↑ Path Request Burst Control, Manual. a8d24177d946de4f1f0a0fe1af9a1338:/page/blob.mu ↗
Reticulum concepts
Announce • Blackhole • Buffer • Channel • Destination • Discovery • Identity • Instance • Interface • Interface Access Code (IFAC) • Link • Network identity • Node • Packet • Path • Propagation node • Resource • Stamp • Transport node
──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────